package cn.pugle.oj.catalog;

import cn.pugle.oj.base.BinarySearch;
import cn.pugle.oj.leetcode.LC34_1;

/**
 * 二分搜索也划分到这:
 * 240
 * 34
 * <p>
 * {@link BinarySearch}
 * {@link java.util.Arrays#binarySearch(int[], int, int, int)}
 * <p>
 * 模板:
 * 二分搜索模板见{@link LC34_1}
 *
 * @author tzp
 * @since 2020/10/17
 */
public interface DivideConquer {
}
